Staircase Join: Teach a relational DBMS to Watch its (Axis) Steps. 2003
نویسندگان
چکیده
Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples. This text applies (and adapts) this successful principle to database-supported XML and XPath processing: the relational system is made tree aware, i.e., tree properties like subtree size, intersection of paths, inclusion or disjointness of subtrees are made explicit. We propose a local change to the database kernel, the staircase join, which encapsulates the necessary tree knowledge needed to improve XPath performance. Staircase join operates on an XML encoding which makes this knowledge available at the cost of simple integer operations (e.g., +,6). We finally report on quite promising experiments with a staircase join enhanced main-memory database kernel.
منابع مشابه
Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps
Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples. This text applies (and adapts) this successful principle to database-supported XML and XPath processing: the relational system is made tree aware, i.e., tree properties like subtree size, intersection of paths, inclusion or disjoin...
متن کاملEnhancing the Tree Awareness of a Relational DBMS: Adding Staircase Join to PostgreSQL
Given a suitable encoding, any relational DBMS is able to answer queries on tree-structured data. However, conventional relational databases are generally not (made) aware of the underlying tree structure and thus fail to make full use of the encoded information. The staircase join is a new join algorithm intended to enhance the tree awareness of a relational DBMS. It was developed to speed up ...
متن کاملRelational Approach to XPath Query Optimization
This thesis contributes to the Pathfinder project which aims at creating an XQuery compiler on top of a relational database system. Currently, it is being implemented on top of MonetDB, a main memory database system. For optimization and portability purposes, Pathfinder first compiles an XQuery expression into its own relational algebra, before translating the query into the query language of t...
متن کاملAn Injection with Tree Awareness Adding Staircase Join to PostgreSQL
The XPath accelerator (“pre/post numbering”) has proven to be an efficient encoding to losslessly store XML data in relational databases. Conventional RDBMSs, however, remain ignorant of interesting properties of the encoded tree data, and make thus no or poor use of these properties. At VLDB 2003 we devised a new join algorithm, staircase join, that encapsulates tree-specific knowledge and can...
متن کامل